Structured strong linearizations of structured rational matrices
نویسندگان
چکیده
Structured rational matrices such as symmetric, skew-symmetric, Hamiltonian, skew-Hamiltonian, Hermitian, and para-Hermitian arise in many applications. Linearizations of rational...
منابع مشابه
Strong Linearizations of Rational Matrices
This paper defines for the first time strong linearizations of arbitrary rational matrices, studies in depth properties and different characterizations of such linear matrix pencils, and develops infinitely many examples of strong linearizations that can be explicitly and easily constructed from a minimal state-space realization of the strictly proper part of the considered rational matrix and ...
متن کاملOrthogonal Rational Functions and Structured Matrices
The space of all proper rational functions with prescribed poles is considered. Given a set of points zi in the complex plane and the weights wi, we define the discrete inner product
متن کاملTrimmed linearizations for structured matrix polynomials
We discuss the eigenvalue problem for general and structured matrix polynomials which may be singular and may have eigenvalues at infinity. We derive condensed forms that allow (partial) deflation of the infinite eigenvalue and singular structure of the matrix polynomial. The remaining reduced order staircase form leads to new types of linearizations which determine the finite eigenvalues and c...
متن کاملStructured Matrices
The expression structured matrices appeared for the first time in a conference title in 1995, specifically in the session “Algorithms for Structured Matrices”, organized within the SPIE conference, held in San Diego (USA) [1, Session 6] and in the “Minisymposium on Structured Matrices” within the ILAS conference, held in Atlanta (USA) [2]. These first experiences led to the organization, in 199...
متن کاملPivoting for Structured Matrices and Rational Tangential Interpolation
Gaussian elimination is a standard tool for computing triangular factorizations for general matrices, and thereby solving associated linear systems of equations. As is well-known, when this classical method is implemented in finite-precision-arithmetic, it often fails to compute the solution accurately because of the accumulation of small roundoffs accompanying each elementary floating point op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2021
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2021.1945525